On the characteristic polynomials of the Frobenius endomorphism for projective curves over finite fields
نویسندگان
چکیده
We give a formula for the number of rational points of projective algebraic curves de ned over a nite eld, and a bound \ a la Weil" for connected ones. More precisely, we give the characteristic polynomials of the Frobenius endomorphism on the etale `-adic cohomology groups of the curve. Finally, as an analogue of Artin's holomorphy conjecture, we prove that, if Y ! X is a nite at morphism between two varieties over a nite eld, then the characteristic polynomial of the Frobenius morphism on H c(X;Q`) divides H i c(Y;Q`)'s one for any i. We are then enable to give an estimation for the number of rational points in a at covering of curves.
منابع مشابه
Scalar Multiplication on Pairing Friendly Elliptic Curves
Efficient computation of elliptic curve scalar multiplication has been a significant problem since Koblitz [13] and Miller [14] independently proposed elliptic curve cryptography, and several efficient methods of scalar multiplication have been proposed (e.g., [8], [9], [12]). A standard approach for computing scalar multiplication is to use the Frobenius endomorphism. If we compute the s-multi...
متن کاملJacobians in isogeny classes of abelian surfaces over finite fields
We give a complete answer to the question of which polynomials occur as the characteristic polynomials of Frobenius for genus-2 curves over finite fields.
متن کاملG-dimension over Local Homomorphisms. Applications to the Frobenius Endomorphism
We develop a theory of G-dimension over local homomorphisms which encompasses the classical theory of G-dimension for finitely generated modules over local rings. As an application, we prove that a local ring R of characteristic p is Gorenstein if and only if it possesses a nonzero finitely generated module of finite projective dimension that has finite G-dimension when considered as an R-modul...
متن کاملPoints Counting Algorithm for One-dimensional Family of Genus 3 Nonhyperelliptic Curves over Finite Fields
In this paper, we present an algorithm for computing the number of points on the Jacobian varieties of one-dimensional family of genus 3 nonhyperelliptic curves over finite fields. We also provide the explicit formula of the characteristic polynomial of the Frobenius endomorphism of the Jacobian of C : y3 = x4 + a over a finite field Fp with p ≡ 1 (mod 3) and p 6≡ 1 (mod 4). Moreover, we give s...
متن کاملComputing in Picard groups of projective curves over finite fields
We give algorithms for computing with divisors on projective curves over finite fields, and with their Jacobians, using the algorithmic representation of projective curves developed by Khuri-Makdisi. We show that various desirable operations can be performed efficiently in this setting: decomposing divisors into prime divisors; computing pull-backs and push-forwards of divisors under finite mor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Finite Fields and Their Applications
دوره 10 شماره
صفحات -
تاریخ انتشار 2004